منابع مشابه
Inequalities for the Completion Times of Stochastic PERT Networks
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملNormalized Completion Revisited
Normalized completion (Marché 1996) is a widely applicable and efficient technique for completion modulo theories. If successful, a normalized completion procedure computes a rewrite system that allows to decide the validity problem using normalized rewriting. In this paper we consider a slightly simplified inference system for finite normalized completion runs. We prove correctness, show faith...
متن کاملScheduling by Positional Completion Times
We present a new type of formulation for scheduling problems where jobs are identical in all aspects but one. This type of formulation is particularly useful for deriving Lagrangian lower and upper bounds for owshop problems, where the jobs only diier in their processing times. We illustrate the eeectiveness of this type of formulation for a two-machine owshop problem where the rst machine is a...
متن کاملWeighted sum of completion times
4. Weighted sum of completion times 1 Eugene L. Lawler, Maurice Queyranne, Andreas S. Schulz, David B. Shmoys 4.1. Smith’s ratio rule 2 4.2. Preference orders on jobs 5 4.3. Preference orders on sequences and series-parallel precedence constraints 8 4.4. NP-hardness of further constrained min-sum problems 14 4.5. The ratio rule via linear programming 18 4.6. Approximation algorithms for 1|prec|...
متن کاملDifferentially Private Matrix Completion, Revisited
We study the problem of privacy-preserving collaborative filtering where the objective is to reconstruct the entire users-items preference matrix using a few observed preferences of users for some of the items. Furthermore, the collaborative filtering algorithm should reconstruct the preference matrix while preserving the privacy of each user. We study this problem in the setting of joint diffe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Transactions on Education
سال: 2005
ISSN: 1532-0545,1532-0545
DOI: 10.1287/ited.6.1.21